Convex combination maps over triangulations, tilings, and tetrahedral meshes
نویسندگان
چکیده
In a recent paper by the first author, a simple proof was given of a result by Tutte on the validity of barycentric mappings, recast in terms of the injectivity of piecewise linear mappings over triangulations. In this note, we make a short extension to the proof to deal with arbitrary tilings. We also give a simple counterexample to show that convex combination mappings over tetrahedral meshes are not necessarily one-to-one. AMS subject classification: Primary: 05C10, 05C85, Secondary: 65D17, 58E20.
منابع مشابه
Convex combination maps
Piecewise linear maps over triangulations are used extensively in geometric modelling and computer graphics. This short note surveys recent progress on the important question of when such maps are one-to-one, central to which are convex combination maps.
متن کاملThree-Dimensional Boundary-Constrained Triangulations
We discuss the problem of generating a boundary-constrained tetrahedral mesh in a convex polyhedron, where the triangular meshes on the boundary faces of the polyhedron are given. These boundary-constrained triangulations are used in our nite element tetrahedral mesh generation method (which includes a convex poly-hedron decomposition step), since a boundary face may be common to two convex pol...
متن کاملConstruction of Three-Dimensional Improved-Quality Triangulations Using Local Transformations
Three-dimensional Delaunay triangulations are the most common form of three-dimensional triangulations known, but they are not very suitable for tetrahedral nite element meshes because they tend to contain poorly-shaped sliver tetrahedra. In this paper, we present an algorithm for constructing improved-quality triangulations with respect to a tetrahedron shape measure. This algorithm uses combi...
متن کاملOn an Automatically Parallel Generation Technique for Tetrahedral Meshes
On an automatically parallel generation technique for tetrahedral meshes Summary : In order to prepare modern nite element analysis a program for the eecient parallel generation of tetrahedral meshes in a wide class of three dimensional domains having a generalized cylindric shape is presented. The applied mesh generation strategy is based on the decomposition of some 2D-reference domain into s...
متن کاملParameterization and Surface Reconstruction
In this paper we study parameterization as a tool for both constructing and smoothing spatial triangulations. Most of the parameterization methods we study are based on convex combination maps, which have the property that the image of each interior vertex is a convex combination of its neighbours. When mapping an existing triangulation, this latter property ensures that whenever the image of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Adv. Comput. Math.
دوره 25 شماره
صفحات -
تاریخ انتشار 2006